PaisleyTrees: A Size-Invariant Tree Visualization
نویسندگان
چکیده
Squeezing large tree structures into suitable visualizations has been a perennial problem. In response to this challenge, we present PaisleyTrees, a size-invariant tree visualization. PaisleyTrees integrate node-of-interest focus with tree-cut presentations to support rapid tree navigation without resorting to zooming and panning. This visualization offers the ability to work with trees of arbitrary depth and breadth, and maintains legibility for displayed elements. These advantages are achieved by using a hybrid layout, inspired by traditional Paisley patterns, that combines node-link, nested and adjacency-based tree layout techniques, and offers both depth and breadth elision.
منابع مشابه
A New Paradigm for Scientiic Visualization
We outline the design of a scientiic visualization system based on a data card display invariant to provide information on the creation and processing of tasks in distributed task pool algorithms. Information aggregates over the tasks and processes are incorporated via non-classical histogram representations showing the distribution of the data within individual bins and by user-controllable tr...
متن کاملOn Relation between the Kirchhoff Index and Laplacian-Energy-Like Invariant of Graphs
Let G be a simple connected graph with n ≤ 2 vertices and m edges, and let μ1 ≥ μ2 ≥...≥μn-1 >μn=0 be its Laplacian eigenvalues. The Kirchhoff index and Laplacian-energy-like invariant (LEL) of graph G are defined as Kf(G)=nΣi=1n-1<...
متن کاملA mobile interface for navigating hierarchical information space
This paper presents ERELT (Enhanced Radial Edgeless Tree), a tree visualization approach on modern mobile devices. ERELT is designed to offer a clear visualization of any tree structure with intuitive interaction. Such visualization can assist users in interacting with a hierarchical structure such as a media collection, file system, etc. In the ERELT visualization, a subset of the tree is disp...
متن کاملExpressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures
We study the expressive power and succinctness of orderinvariant sentences of first-order (FO) and monadic second-order (MSO) logic on graphs of bounded tree-depth. Order-invariance is undecidable in general and, therefore, in finite model theory, one strives for logics with a decidable syntax that have the same expressive power as orderinvariant sentences. We show that on graphs of bounded tre...
متن کاملTree-Map: A Visualization Tool for Large Data
Traditional approach to represent hierarchical data is to use directed tree. But it is impractical to display large (in terms of size as well complexity) trees in limited amount of space. In order to render large trees consisting of millions of nodes efficiently, the Tree-Map algorithm was developed. Even file system of UNIX can be represented using Tree-Map. Definition of Tree-Maps is recursiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- EAI Endorsed Trans. Creative Technologies
دوره 1 شماره
صفحات -
تاریخ انتشار 2014